On the Computation of Correctly Rounded Sums
نویسندگان
چکیده
منابع مشابه
Towards Correctly Rounded Transcendentals
The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be solved, at least for the double-precision fo...
متن کاملEmulation of FMA and correctly-rounded sums: proved algorithms using rounding to odd
Rounding to odd is a non-standard rounding on floating-point numbers. By using it for some intermediate values instead of rounding to nearest, correctly rounded results can be obtained at the end of computations. We present an algorithm for emulating the fused multiply-and-add operator. We also present an iterative algorithm for computing the correctly rounded sum of a set floating-point number...
متن کاملThe abc conjecture and correctly rounded reciprocal square roots
The reciprocal square root calculation = 1= √ x is very common in scienti/c computations. Having a correctly rounded implementation of it is of great importance in producing numerically predictable code among today’s heterogenous computing environment. Existing results suggest that to get the correctly rounded in a 3oating point number system with p signi/cant bits, we may have to compute up to...
متن کاملFast and correctly rounded logarithms in double-precision
This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these goals in the crlibm library. There are two novel aspects to this approach. The first is the proof framework, and in general the techniques used to balance performance and provability. The second is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2012
ISSN: 0018-9340
DOI: 10.1109/tc.2011.27